Determining the thermal set point in interacting biological systems
نویسندگان
چکیده
منابع مشابه
Cooperativity in biological systems
Living organisms can sense and respond to external and internal stimuli. Response isdemonstrated in many forms including modulation of gene expression profiles, motility,secretion, cell death, etc. Nevertheless, all forms share a basic property: they depend on sensingsmall changes in the concentration of an effector molecule or subtle conformational changes ina protein and invoking the appropri...
متن کاملA comparison of methods for determining HIV viral set point.
During a course of human immunodeficiency virus (HIV-1) infection, the viral load usually increases sharply to a peak following infection and then drops rapidly to a steady state, where it remains until progression to AIDS. This steady state is often referred to as the viral set point. It is believed that the HIV viral set point results from an equilibrium between the HIV virus and immune respo...
متن کاملBackaction noise in strongly interacting systems: the dc SQUID and the interacting quantum point contact.
We study the backaction noise and measurement the efficiency (i.e., noise temperature) of a dc SQUID amplifier and, equivalently, a quantum point-contact detector formed in a Luttinger liquid. Using a mapping to a dissipative tight-binding model, we show that these systems are able to reach the quantum limit even in regimes where several independent transport processes contribute to the current...
متن کاملStructure of the Fixed Point of Condensing Set-Valued Maps
In this paper, we present structure of the fixed point set results for condensing set-valued map. Also, we prove a generalization of the Krasnosel'skii-Perov connectedness principle to the case of condensing set-valued maps.
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The FASEB Journal
سال: 2007
ISSN: 0892-6638,1530-6860
DOI: 10.1096/fasebj.21.5.a637-e